Solving the Graph Coloring Problem Using Cuckoo Search
نویسندگان
چکیده
We adapt the Cuckoo Search (CS) algorithm for solving the three color Graph Coloring Problem (3-GCP). The difficulty of this task is adapting CS from a continuous to a discrete domain. Previous researches used sigmoid functions to discretize the Lévi Flight (LF) operator characteristic of CS, but this approach does not take into account the concept of Solution Distance, one of the main characteristics of LF. In this paper, we propose a new discretization of CS that maintains LF’s solution distance concept. We also simplify CS’s parasitism operator, reducing the number of evaluations necessary. We compare different combinations of the proposed changes, using GA as a baseline, on a set of randomly generated 3-GCP problems. The results show the importance of a good discretization of the LF operator to increase the success rate and provide auto-adaptation to the CS algorithm.
منابع مشابه
An improved Cuckoo Search Algorithm for Solving Planar Graph Coloring Problem
In this paper, we proposed an improved cuckoo search optimization (ICS) algorithm for solving planar graph coloring problem. The improved cuckoo search optimization algorithm is consisting of the walking one strategy, swap and inversion strategy and greedy strategy. The proposed improved cuckoo search optimization algorithm can solve the planar graph coloring problem using four-colors more effi...
متن کاملA Binary Cuckoo Search Algorithm for Graph Coloring Problem
The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm...
متن کاملQuantum inspired cuckoo search algorithm for graph colouring problem
The graph coloring problem (GCP) is one of the most interesting, studied and difficult combinatorial optimization problems. That is why, several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics and hybrid approaches. In this paper, we try to solve the graph coloring problem using a new approach based on the quantum inspired cuc...
متن کاملModified cuckoo optimization algorithm (MCOA) to solve graph coloring problem
In recent years, various heuristic optimization methods have been developed. Many of these methods are inspired by swarm behaviors in nature, such as particle swarm optimization (PSO), firefly algorithm (FA) and cuckoo optimization algorithm (COA). Recently introduced COA, has proven its excellent capabilities, such as faster convergence and better global minimum achievement. In this paper a ne...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کامل